The balanced 2-median and 2-maxian problems on a tree
نویسندگان
چکیده
This paper deals with the facility location problems with balancing on allocation clients to servers. Two bi-objective models are considered, in which one objective is the traditional p-median or p-maxian objective and the second is to minimize the maximum demand volume allocated to any facility. An edge deletion method with time complexity O(n) is presented for the balanced 2-median problem on a tree. For the balanced 2-maxian problem, it is shown the optimal solution is two end vertices of the diameter of the tree, which can be obtained in a linear time.
منابع مشابه
The inverse $p$-maxian problem on trees with variable edge lengths
We concern the problem of modifying the edge lengths of a tree in minimum total cost so that the prespecified p vertices become the p-maxian with respect to the new edge lengths. This problem is called the inverse p-maxian problem on trees. Gassner proposed efficient combinatorial alogrithm to solve the the inverse 1-maxian problem on trees in 2008. For the problem with p ≥ 2, we claim that the...
متن کاملThe Invere p-Maxian Problem on Trees with Variable Edge Lengths
We concern the problem of modifying the edge lengths of a tree in minimum total cost so that the prespecified p vertices become the p-maxian with respect to the new edge lengths. This problem is called the inverse p-maxian problem on trees. Gassner proposed efficient combinatorial alogrithm to solve the the inverse 1-maxian problem on trees in 2008. For the problem with p ≥ 2, we claim that the...
متن کاملOn the Average Height of b-Balanced Ordered Trees
An ordered tree with height h is b-balanced if all its leaves have a level l with h − b <= l <= h, where at least one leaf has a level equal to h − b. For large n, we shall compute asymptotic equivalents to the number of all b-balanced ordered trees with n nodes and of all such trees with height h. Furthermore, assuming that all b-balanced ordered trees with n nodes are equally likely, we shall...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملAn algorithm for finding a k-median in a directed tree
We consider the problem of finding a k-median in a directed tree. We present an algorithm that computes a k-median in O(Pk) time where k is the number of resources to be placed and P is the path length of the tree. In the case of a balanced tree, this implies O(kn log n) time, in a random tree O(k2n3/2), while in the worst case O(kn). Our method employs dynamic programming and uses O(nk) space,...
متن کامل